Convex hull of face vectors of colored complexes
نویسنده
چکیده
In this paper we verify a conjecture by Kozlov (Discrete Comput Geom 18 (1997) 421–431), which describes the convex hull of the set of face vectors of r-colorable complexes on n vertices. As part of the proof we derive a generalization of Turán’s graph theorem.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملL-CONVEX SYSTEMS AND THE CATEGORICAL ISOMORPHISM TO SCOTT-HULL OPERATORS
The concepts of $L$-convex systems and Scott-hull spaces are proposed on frame-valued setting. Also, we establish the categorical isomorphism between $L$-convex systems and Scott-hull spaces. Moreover, it is proved that the category of $L$-convex structures is bireflective in the category of $L$-convex systems. Furthermore, the quotient systems of $L$-convex systems are studied.
متن کاملSeveral Convex-Ear Decompositions
In this paper we give convex-ear decompositions for the order complexes of several classes of posets, namely supersolvable lattices with non-zero Möbius functions and rank-selected subposets of such lattices, rank-selected geometric lattices, and rank-selected face posets of shellable complexes which do not include the top rank. These decompositions give us many new inequalities for the h-vecto...
متن کاملComplexes 6 Simplicial complex
Definition 20 (simplex). A k-simplex σ is the convex hull of a set P of k + 1 affinely independent points. In particular, a 0-simplex is a vertex, a 1-simplex is an edge, a 2-simplex is a triangle, and a 3-simplex is a tetrahedron. A k-simplex is said to have dimension k. A face of σ is a simplex that is the convex hull of a nonempty subset of P. Faces of σ come in all dimensions from zero (σ’s...
متن کاملFlag f-vectors of colored complexes
It is shown that conditions stronger in a certain sense than colorshifting cannot be placed on the class of colored complexes without changing the characterization of the flag f-vectors. In the late 1970s, Stanley [6] showed that two particular classes of simplicial complexes have equivalent characterizations of their flag f-vectors. Several years later, Björner, Frankl, and Stanley [1] showed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 36 شماره
صفحات -
تاریخ انتشار 2014